polynomial complexity
英 [ˌpɒli'nəʊmiəl kəmˈpleksəti]
美 [ˌpɑli'noʊmiəl kəmˈpleksəti]
网络 多项式复杂度; 多项式复杂性
双语例句
- Algorithms with polynomial complexity for determining the stability of nondeterministic discrete-event systems
判定非确定离散事件系统稳定性的多项式复杂度算法 - States the significance of attributes in the incomplete decision table by introducing decision attribute support degree, which is then used as heuristic information for selecting attributes, this algorithm has a polynomial time complexity.
通过引入决策属性支持度对不完备决策表中属性的重要性进行了定义，并以此作为启发信息进行属性的选择，该算法的时间复杂度是多项式的。 - Employing a suboptimal algorithm of polynomial time complexity, the assignment method is applied to a particular multisensor fusion system consisting of radar and IRST to solve the difficult association problems.
利用一个具有多项式时间复杂度的次优算法，多重分配的方法被应用到由雷达和红外所组成的异类多传感器数据融合系统之中，实现了其中的多目标互联。 - Shop scheduling problem is typically NP-hard, which means that it is impossible to find the global optimum in polynomial complexity.
车间调度是一类典型的NP-hard问题，已被证明在多项式时间内得不到最优值。 - An infeasible path-following algorithm is constructed, and its polynomial complexity is analyzed.
基于这组方程，文中建立了一个求解线性互补的不可行内点算法，并分析了它的多项式复杂度。 - This approach, taking the conventional detector output as the initial solution, uses the tabu search ( TS) algorithm directly to solve the nonlinear optimization problem of the optimum multiuser detection, it is conceptually simply and has polynomial computational complexity.
该方法利用传统检测方法的输出作为初始解，直接应用禁忌搜索算法来解决最佳多用户检测的非线性优化组合问题。 - The computational complexity of the improved algorithm approaches polynomial complexity, much less than 2 N ( N is the vertex number of a graph).
后者的计算时间复杂性远远低于2N（N为图的顶点数），已接近于多项式时间复杂性。 - Authors produce an algorithm for seeking the maximum Capacity Paths from the specified node to all other nodes in the transportation network, which has polynomial complexity O ( n 2). The correctness of the algorithm is verified in detail.
给出了一个求运输网络从固定顶点到所有其他顶点的多项式算法x1，证明了该算法的正确性，分析了它的复杂性为O（n2）。 - This algorithm can simplify the data association and has polynomial complexity.
该算法采用观测-航迹关联，具有相对简单的多项式复杂度。 - No-wait flow shop problem is one of flow shop problems, and is a typically NP-complete problem, which means that it is impossible to find the global optimum in polynomial complexity.
无等待问题是流水车间调度中的一种，是一类典型的NP完全问题，已被证明在多项式时间内得不到最优值。 - Its BER performance is close to that of the optimal multiuser detector and the computational complexity is polynomial complexity.
该算法的计算复杂度是与用户数相关的多项式复杂度，与最优多用户检测器的指数复杂度相比，具有较好的可行性和实用性。 - An algorithm is presented for seeking the critical paths in the overall planning graph, which has polynomial complexity O ( n 3). The theory, which the algorithm depends on, is verified in detail.
给出了1个求统筹图中关键路线的多项式算法，证明了该算法的理论依据，分析了它的复杂性为O（n3）。 - An Algorithm with Polynomial Time Complexity for Verifying Secrecy Properties of Cryptographic Protocols
一种多项式时间复杂度的密码协议秘密性验证方法 - Our algorithms are of polynomial complexity.
该算法具有多项式复杂度。 - In this paper, based on a simplified Bayesian network classification model, we apply its structure learning algorithm, with polynomial time complexity, to the classification of database information, and get a compromise between the learning efficiency and classification precision.
本研究在一种简化的贝叶斯网络分类模型的基础上，利用其多项式时间复杂度的结构学习算法，将其应用于数据库信息分类，实现了学习效率和分类精度的一种折衷。 - An approximation algorithm for the total tardiness problem is presented in this paper, which possesses the following properties: polynomial complexity, a local solution with respect to backward shift neighbourhood and finite performance ratio.
对于一台机器的总延误问题，本文提出了一个近似算法，它具有以下性质：多项式复杂度，给出局部解（相应于后移邻域），有界的性能比。 - Finally, the problem of quadratic programming with integer constraints is solved by utilizing ε-approximation with polynomial approximate complexity.
采用具有多项式近似复杂度的ε近似算法解决带整数约束的二次规划问题。 - The fact that it is impossible to find the global optimum in polynomial complexity has been proved.
理论上已经证明要在多项式时间复杂度内对这一类问题找到全局最优解是不可能的。 - The SDP solution has polynomial complexity, so the SDP multiuser detector has polynomial complexity.
由于这种方法采用的半正定规划问题求解方法具有多项式程度的复杂性，所以这种新的SDP多用户检测方法也具有多项式程度的复杂性。 - A heuristic method is presented for the scheduling algorithm to jump out local optimization and reach global optimization in polynomial time complexity.
采用启发式机制使得调度算法的解空间搜索过程具有跳出局部最优的能力，此算法可在多项式时间复杂度下得到全局最优调度解。 - Under certain condition the algorithm is complete and has polynomial complexity.
这种算法在一定的假设条件下，是完备的且仅具有多项式的计算复杂性。 - Interior point method is a polynomial time complexity algorithm for solving convex programming, and this method and many related algorithms have been widely used in power system.
内点算法是求解凸规划的多项式时间复杂度算法，各种内点算法及其相关算法在求解最优潮流和动态最优潮流问题上得到了广泛的应用。 - Because the most scheduling problem is NP hard, it is impossible to find out common algorithm with polynomial complexity.
由于调度问题大多数都是具有NP难度的组合优化问题，寻找具有多项式复杂性的优化方法几乎是不可能的。 - The other is a new algorithm for solving the inverse problem of SVM. It has polynomial time complexity, and gets the optimal partition using margin matrix after clustering.
另一个是多项式级时间复杂度的支持向量机反问题求解算法。该方法首先对数据进行聚类，然后利用类间间隔矩阵寻找最优划分。 - Investigations from the 1970s to now, show that for NP hard problems, there possibly does not exist an algorithm is of Polynomial time complexity.
20世纪70年代至今的计算复杂性理论表明，对于NP难度问题可能根本就不存在多项式时间复杂度的求解算法，于是人们使用各种启发式算法求此类问题的近似解。 - In attack graph area, this thesis proposes a kind of polynomial complexity and object-oriented approach to building attack graphs. This method aims at solving the attack graph construction problem in large-scale network environment.
在攻击图方面，本文提出一种面向对象的攻击图构建方法，以解决大规模网络环境下的攻击图构建问题。 - In the field of computer science theory, there is a famous unsolved problem: NP problem ( Non-deterministic Polynomial), is a non-deterministic polynomial complexity of the problem.
在计算机科学的理论领域中，有一个尚未解决的著名的难题：NP（Non-deterministicPolynomial）问题，也就是多项式复杂程度的非确定性问题。 - We consider the Agent Coalition Formation Problem with logical dependency and transfer cost. And, we propose an algorithm with polynomial time complexity on the basis of Dynamic Planning, to solve this problem.
在考虑子任务间逻辑依赖关系和转移成本的情况下，探讨了针对这类复杂任务结构的服务Agent联盟形成问题，并且提出了一种基于动态规划的多项式时间算法。 - Two network flow based algorithms with polynomial time complexity were proposed.
在此基础上提出了基于网络流的具有多项式复杂度的算法。 - Up to now, there is no graph isomorphism algorithm with polynomial complexity for general graphs in the classical computation.
截至目前，在经典计算领域，尚无面向一般图的多项式级计算复杂度的图同构算法。